Model Checking Cryptographic Protocols with Interval Temporal Logic
نویسندگان
چکیده
This paper investigates model-checking Needham-Schroeder Public-Keyprotocol using Propositio nal Projection Temporal Logic (PPTL). To this end, the ProMeLa model of the protocol is firstly constructed then the properties to verify is specified by PPTL formulas, which is translated into automata and further to Never Claim. The transformation is by the method we present and is implemented by an automatic tool we developed. After that, the verification is done base on SPIN, and the results shows PPTL model checking approach is sound and can be used to verify more generalized communication protocols.
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملEffective reduction of cryptographic protocols specification for model-checking with Spin
In this article a practical application of the Spin model checker for verifying cryptographic protocols was shown. An efficient framework for specifying a minimized protocol model while retaining its functionality was described. Requirements for such a model were discussed, such as powerful adversary, multiple protocol runs and a way of specifying validated properties as formulas in temporal lo...
متن کاملAutomatic verification of temporal-epistemic properties of cryptographic protocols
We present a technique for automatically verifying cryptographic protocols specified in the mainstream specification language CAPSL. We define a translation from CAPSL models into interpreted systems, a popular semantics for temporal-epistemic logic, and rewrite CAPSL goals as temporal-epistemic specifications. We present a compiler that implements this translation. The compiler links to the sy...
متن کاملTowards Model Checking Cryptographic Protocols with Dynamic Epistemic Logic
We present a variant of Kripke models to model knowledge of large numbers, applicable to cryptographic protocols. Our Epistemic Crypto Logic is a variant of Dynamic Epistemic Logic to describe communication and computation in a multi-agent setting. It is interpreted on register models which efficiently encode larger Kripke models. As an example we formalize the well-known Diffie-Hellman key exc...
متن کاملA Brutus Logic for a Spi-calculus Dialect Acm Computing Classiication: D.2.4 Software/program Veriication -f.3.1 Specifying and Verifying and Reasoning about Programs
In the eld of process algebras, the spi-calculus, a modi-ed version of the-calculus with encryption primitives, is indicated as an expressive speciication language for cryptographic protocols. In spi-calculus basic security properties, such as secrecy and integrity can be formalized as may-testing equivalences which do not seem easily ex-tendible to express other kinds of interesting properties...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCIT
دوره 5 شماره
صفحات -
تاریخ انتشار 2010